The connection machine
نویسنده
چکیده
Someday, perhaps soon, we will build a machine that will be able to perform the functions of a human mind, a thinking machine. One of the many problems that must be faced in designing such a machine is the need to process large amounts of information rapidly, more rapidly than is ever likely to be possible with a conventional computer. This document describes a new type of computing engine called a Connection Machine, which computes through the interaction of many, say a million, simple identical processing/memory cells. Because the processing takes place concurrently, the machine can be much faster than a traditional computer. Thesis Supervisor: Professor Gerald Sussman
منابع مشابه
An Application of Genetic Network Programming Model for Pricing of Basket Default Swaps (BDS)
The credit derivatives market has experienced remarkable growth over the past decade. As such, there is a growing interest in tools for pricing of the most prominent credit derivative, the credit default swap (CDS). In this paper, we propose a heuristic algorithm for pricing of basket default swaps (BDS). For this purpose, genetic network programming (GNP), which is one of the recent evolutiona...
متن کاملInvestigation of Carbon Fiber Reinforced Polymer Composite Welding with a New Tool in Friction Stir Welding Method
Application of thermoplastic materials has increased dramatically in recent decades due to its recyclability, low density, resistance to chemical changes. The friction stir welding process is one of the new methods of solid state welding, which has recently undergone a significant improvement. In this research, using a new tool Made of plain carbon steel st37 in friction stir welding and low co...
متن کاملAccelerated learning on the connection machine
The complexity of most machine learning techniques can be improved by transforming iterative components into their parallel equivalent. Although this parallelization has been considered in theory, few implementations have been performed on existing parallel machines. The parallel architecture of the Connection Machine provides a platform for the implementation and evaluation of parallel learnin...
متن کاملRecognition Algorithms for the Connection Machine
This paper describes an object recognition algorithm both on a sequential machine and on a SIMD parallel processor such as the MIT Connection Machine. The parallel version is shown to run three to four orders of magnitude faster than the sequential version.
متن کاملAn Assessment of the Connection Machine
The CM-2 is an example of a connection machine. The strengths and problems of this implementation are considered. Then important issues in the architecture and programming environment of connection machines in general are considered. These are contrasted with the same issues in MD multiprocessors and multicomputers.
متن کاملAutomatic Target Recognition on the Connection Machine
Automatic target recognition (ATR) is a computationally intensive problem that benefits from the abilities of the Connection Machine (CM), a massively parallel computer used for data-level parallel computing. The large computational resources of the CM can efficiently handle an approach to ATR that uses parallel stereo-matching and neural-network algorithms. Such an approach shows promise as an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985